The $ (a, d) $-ascending subgraph decomposition
نویسندگان
چکیده
منابع مشابه
On Star Forest Ascending Subgraph Decomposition
The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with ( n+1 2 ) edges admits an edge decomposition G = H1 ⊕ · · · ⊕ Hn such that Hi has i edges and it is isomorphic to a subgraph of Hi+1, i = 1, . . . , n − 1. We show that every bipartite graph G with ( n+1 2 ) edges such that the degree sequence d1, . . . , dk of one of the stable sets satisfies di ≥ n − i + 1, ...
متن کاملA note on the ascending subgraph decomposition problem
Let G be a graph with (” : ‘) edges. We say G has an ascending subgraph decomposition (ASD) if the edge set of G can be partitioned into n sets generating graphs G,, G,, . , G, such that IE(G,)I = i (for i = 1, 2, . . , n) and G, is isomorphic to a subgraph of G,+r for i = 1,2, . . , n 1. In this note, we prove that if G is a graph of maximum degree d C [(n + 1)/2j on (” l ‘) edges, then G has ...
متن کاملOn the ascending subgraph decomposition problem for bipartite graphs
The Ascending Subgraph Decomposition (ASD) Conjecture asserts that every graph G with ( n+1 2 ) edges admits an edge decomposition G = H1 ⊕ · · · ⊕Hn such that Hi has i edges and is isomorphic to a subgraph of Hi+1, i = 1, . . . , n−1. We show that every bipartite graph G with ( n+1 2 ) edges such that the degree sequence d1, . . . , dk of one of the stable sets satisfies di ≥ n − i + 2, 1 ≤ i ...
متن کاملAscending subgraph decompositions of regular graphs
We prove that every regular graph with ( n+1 2 ) + t edges, 06 t ¡ n + 1, can be decomposed into n subgraphs G1; G2; : : : ; Gn such that |E(Gi)| = i and Gi 6Gi+1 for i = 1; 2; : : : ; n − 1 and |E(Gn)|= n+ t. c © 2002 Elsevier Science B.V. All rights reserved.
متن کاملEfficient Subgraph Isomorphism Detection: A Decomposition Approach
ÐGraphs are a powerful and universal data structure useful in various subfields of science and engineering. In this paper, we propose a new algorithm for subgraph isomorphism detection from a set of a priori known model graphs to an input graph that is given online. The new approach is based on a compact representation of the model graphs that is computed offline. Subgraphs that appear multiple...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Tamkang Journal of Mathematics
سال: 2006
ISSN: 2073-9826,0049-2930
DOI: 10.5556/j.tkjm.37.2006.151